Selecting contact points for reaching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selecting Heavily Covered Points

A collection of geometric selection lemmas is proved, such as the following: For any set P of n points in three-dimensional space and any set ,9 of m spheres, where each sphere passes through a distinct point pair in P, there exists a point x, not necessarily in P, that is enclosed by f2 (m ! (n log )) of the spheres in S. Similar results apply in arbitrary fixed dimensions, and for geometric b...

متن کامل

Trust Management for Selecting Trustworthy Access Points

Both free and low-priced mobile wireless networks are expanding and its users are more numerous every day. This success is particularly due to the mobility offered to users. These networks have promoted and widespread the success and availability of mobile devices and their access technologies such as Wi-Fi, WiMAX and Bluetooth. Nevertheless, despite of their wide success, the problem is that t...

متن کامل

Selecting Landmark Points for Sparse Manifold Learning

There has been a surge of interest in learning non-linear manifold models to approximate high-dimensional data. Both for computational complexity reasons and for generalization capability, sparsity is a desired feature in such models. This usually means dimensionality reduction, which naturally implies estimating the intrinsic dimension, but it can also mean selecting a subset of the data to us...

متن کامل

Planning contact points for humanoid robots

We present a planner for underactuated hyper-redundant robots, such as humanoid robots, for which the movement can only be initiated by taking contacts with the environment. We synthesize our previous work on the subject and go further into details to give an in-depth description of the contact planning problem and the mechanisms of our contact planner. We highlight the structure of the problem...

متن کامل

Selecting operating points for discrete-time gain scheduling

Kenneth H. McNichols / M. Sami Fadali Department of Electrical Engineering / MS 260 University of Nevada, Reno Reno, NV 89557 [email protected] / [email protected] Abstract Gain scheduling is a popular approach for nonlinear control system design. A controller is obtained by designing a set of controllers at operating points and then linearly interpolating controller values between them. Howe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2004

ISSN: 1534-7362

DOI: 10.1167/4.8.144